The maze is generated procedurally in real time. After completion, the solution path is drawn step by step.

Maze Generation: The simulation uses a recursive backtracking algorithm. It starts at the initial cell, randomly visits unvisited neighbors, and carves passages. When no unvisited neighbors remain, the algorithm backtracks until new paths are available.

Maze Solving: Once the maze is fully generated, a depth-first search is used to animate a path from the start (top-left) to the finish (bottom-right) of the maze.

All graphics are rendered procedurally using the HTML5 canvas element, providing a dynamic demonstration of both maze generation and solving.